Queueing Petri Nets-A formalism for the combined qualitative and quantitative analysis of systems

System analysis is often needed with respect to both qualitative and quantitative aspects. In the last decades, several formalisms have been developed that attempt to combine these aspects in one description. Present emphasis is on Stochastic Petri Nets. Amongst others, one disadvantage of these formalisms lies with the diiculties when describing scheduling strategies with Petri Net elements. This article describes a new version of Queueing Petri Nets (QPNs), which combines Queueing Networks and Petri Nets, aiming at eliminating these disadvantages. The new version also exhibits the modeling of timed transitions and 'timeless' queues for describing pure scheduling mechanisms. QPNs are a superset of Queueing Networks and (Generalized Stochastic) Petri Nets. The analysis of QPNs is discussed and it is shown that eecient analysis techniques from Petri Net theory can be exploited for analysis of QPNs, thus supporting the general objective of combining Petri Net and Queueing Network formalisms.